搜索资源列表
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
sa_01.zip
- 本程序是在MATLAB平台上面实现的用模拟退火算法解决01背包问题。,This procedure is in the MATLAB platform achieved with simulated annealing algorithm to solve knapsack problem 01.
knapsack
- knapsack，用动态规划解背包问题，可直接在eclipse上运行。-knapsack, knapsack problem using dynamic programming solution can be directly run in eclipse.
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
Knapsack
- 背包问题,一个不错的动态规划算法显示,值得一看-Knapsack problem, a good dynamic programming algorithm indicates that worth a visit
test-data-for-01-knapscap-problem
- 这个是用于01背包问题的测试数据，很多论文都用这其中的数据集来测试-This is a knapsack problem for the 01 test data, a lot of papers with which the data set to test
knapsack
- 九讲背包问题。一本很好的算法书，详细讲解了背包问题。-Nine speakers knapsack problem. A good algorithm book, explain in detail the knapsack problem.
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
beibaobeibao
- 这是一个0/1背包问题的解决，有图形界面，是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
zero_one_question
- 算法中的经典问题：0——1 背包问题 在该程序中运用了动态规划算法成功解决了0——1背包问题-Classic problem of algorithm 0- 1 knapsack problem in the process use of dynamic programming algorithms succeeded in solving 0- 1 Knapsack Problem
Binary-Knapsack-Problem
- Binary Knapsack Problem implementation using Genetic Algorithm.
knapsack-problem
- 用贪婪算法解决背包问题，使用的语言是C语言。写了一个小程序并与传统的程序进行了比较。-Greedy algorithm to solve knapsack problem, the language used is C language. A small program is writen and compared with the traditional procedure were .
Binary-Knapsack-Problem
- binary knapsack problem using genetic algorithm
Binary-Knapsack-Problem
- ga knapsack problem genetic algorythm
knapsack-problem
- the knapsack problem
Multiobjective-Knapsack-Problem
- Multiobjective Knapsack Problem
0-1-knapsack-problem
- 动态规划解决01背包问题,采用c语言实现-01 dynamic programming to solve the knapsack problem, with c language
knapsack-problem
- 背包问题即给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed.
knapsack problem
- 用动态规划解决01背包问题，以及回溯找到最终解，完美的解决了动态规划的思想(Use dynamic programming to solve the 01 knapsack problem.)